Multiple Adjunction in Feature-Based Tree-Adjoining Grammar
نویسندگان
چکیده
In parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation, and statistical language modeling. However, the parsing algorithm they propose is not directly applicable to Feature-Based TAGs (FB-TAG). We provide a recognition algorithm for FB-TAG that supports both dependent and independent derivations. The resulting algorithm combines the benefits of independent derivations with those of Feature-Based grammars. In particular, we show that it accounts for a range of interactions between dependent vs. independent derivation on the one hand, and syntactic constraints, linear ordering, and scopal vs. nonscopal semantic dependencies on the other hand.
منابع مشابه
Feature-Based TAG in place of multi-component adjunction: Computational Implications
Using feature-based Tree Adjoining Grammar (TAG), this paper presents linguistically motivated analyses of constructions claimed to require multi-component adjunction. These feature-based TAG analyses permit parsing of these constructions using an existing uniication-based Earley-style TAG parser, thus obviating the need for a multi-component TAG parser without sacriicing linguistic coverage fo...
متن کاملTree Adjoining Grammar, Semantic Calculi and Labelling Invariants
Recently, proposals have been made to combine Tree Adjoining Grammar (TAG) with either Glue or Flat Semantic Representation Languages. In this paper, we additionally specify the combination of TAG with λ-based semantics and compare the three approaches. We observe several invariants and suggest that semantic construction in TAG is governed by a set of general principles that can be used to faci...
متن کاملA Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars
This paper describes the design and implementation of a Python-based interface for wide coverage Lexicalized Tree-adjoining Grammars. The grammars are part of the XTAGGrammar project at the University of Pennsylvania, which were hand-written and semi-automatically curated to parse real-world corpora. We provide an interface to the wide coverage English and Korean XTAG grammars. Each XTAG gramma...
متن کاملMixed Parsing of Tree Insertion and Tree Adjoining Grammars
Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees that can be combined by means of the simpler kind of adjunction defined for Tree Insertion Grammar. In this paper, we describe a parsing algorithm ...
متن کاملTree Adjoining Grammars in a Fragment of the Lambek Calculus
This paper presents a logical formalization of Tree Adjoining Grammar (TAG). TAG deals with lexicalized trees and two operations are available: substitution and adjunction. Adjunction is generally presented as an insertion of one tree inside another, surrounding the subtree at the adjunction node. This seems to contradict standard logical ability. We prove that some logical formalisms, namely a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Linguistics
دوره 41 شماره
صفحات -
تاریخ انتشار 2015